Paley Type Group Schemes from Cyclotomic Classes and Arasu-dillon-player Difference Sets
نویسنده
چکیده
In this paper, we present constructions of abelian Paley type group schemes by using multiplicative characters of finite fields and Arasu-Dillon-Player difference sets. The constructions produce many new Paley type group schemes that were previous unknown in our classification of Paley type group schemes in finite fields of small orders.
منابع مشابه
Difference systems of sets and cyclotomy
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code synchronization. A method for the construction of DSS from partitions of cyclic difference sets was introduced in [6] and applied to cyclic difference sets (n, (n−1)/2, (n−3)/4) of Paley type, where n ≡ 3 (mod 4) is a prime number. This paper develops similar constructions for prime numbers n ≡ ...
متن کاملCyclic affine planes and Paley difference sets
Arasu, K.T. and A. Pott, Cyclic affine planes and Paley difference sets, Discrete Mathematics 106/107 (1992) 19-23. The existence of a cyclic affine plane implies the existence of a Paley type difference set. We use the existence of this difference set to give the following condition on the existence of cyclic affine planes of order n: If n 8 mod 16 then n 1 must be a prime. We discuss the stru...
متن کاملAlmost difference sets and their sequences with optimal autocorrelation
Almost difference sets have interesting applications in cryptography and coding theory. In this paper, we give a wellrounded treatment of known families of almost difference sets, establish relations between some difference sets and some almost difference sets, and determine the numerical multiplier group of some families of almost difference sets. We also construct six new classes of almost di...
متن کاملCommutative Association Schemes Whose Symmetrizations Have Two Classes
If a symmetric association scheme of class two is realized as the symmetrization of a commutative association scheme, then it either admits a unique symmetrizable fission scheme of class three or four, or admits three fission schemes, two of which are class three and one is of class four. We investigate the classification problem for symmetrizable (commutative) association schemes of two-class ...
متن کاملOn a Class of Almost Difference Sets Constructed by Using the Ding-Helleseth-Martinsens Constructions
Pseudorandom binary sequences with optimal balance and autocorrelation have many applications in stream cipher, communication, coding theory, etc. It is known that binary sequences with three-level autocorrelation should have an almost difference set as their characteristic sets. How to construct new families of almost difference set is an important research topic in such fields as communicatio...
متن کامل